Minimal Separating Sets for
نویسنده
چکیده
For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously introduced by McNaughton McN93], the algorithmic construction of smallest separating sets is not treated in the literature. In this paper we show that the test whether in a Muller automaton a separating set of a given size exists is an NP-complete problem. As a step towards an eecient computation of a separating set of minimal size we present an algorithm in the second part of the paper, based on an analysis of the loop structure of the given automaton. An implementation is available.
منابع مشابه
Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملRotation Sets and Almost Periodic Sequences
We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segments as well as non-convex and even plane-separating continua. This shows that restrictions which hold for rotation set on the whole torus are not valid on minimal sets. The proof uses a construction of rotational horseshoes by Kwapisz to transfer the ...
متن کاملSeparability by two lines and by flat polygonals∗
In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N logN)-time optimal algorithms for computing all the separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and the flattest minimal constant turn polygonal line separating two sets of points.
متن کاملSeparability by two lines and by nearly straight polygonal chains
In this paper we study the separability in the plane by two criteria: double-wedge separability and Θ-separability. We give an O(N logN)-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an O((N/Θ0) logN)-time algorithm for computing a nearly-straight minimal Θ-polygonal chain separating...
متن کاملSeparating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and recently they have been studied actively. However, there has not been much research on how condensed representations should actually be represented. In this paper we propose a general approach to build condensed repr...
متن کامل